Block Preconditioners for Coupled Physics Problems
نویسندگان
چکیده
Finite element discretizations of multiphysics problems frequently give rise to blockstructured linear algebra problems that require effective preconditioners. We build two classes of preconditioners in the spirit of well-known block factorizations [21, 16] and apply these to the diffusive portion of the bidomain equations and the Bénard convection problem. An abstract generalized eigenvalue problem allows us to give application-specific bounds for the real parts of eigenvalues for these two problems. This analysis is accompanied by numerical calculations with several interesting features. One of our preconditioners for the bidomain equations converges in five iterations for a range of problem sizes. For Bénard convection, we observe mesh-independent convergence with reasonable robustness with respect to physical parameters, and offer some preliminary parallel scaling results on a multicore processor via MPI.
منابع مشابه
Block recursive LU preconditioners for the thermally coupled incompressible inductionless MHD problem
The thermally coupled incompressible inductionless magnetohydrodynamics (MHD) problem models the flow of an electrically charged fluid under the influence of an external electromagnetic field with thermal coupling. This system of partial differential equations is strongly coupled and highly nonlinear for real cases of interest. Therefore, fully implicit time integration schemes are very desirab...
متن کاملPreconditioners for regularized saddle point problems with an application for heterogeneous Darcy flow problems
Saddle point problems arise in the modelling of many important practical problems. Preconditioners for the corresponding matrices on block triangular form, based on coupled inner-outer iteration methods are analyzed and applied to a Darcy flow problem, possibly with strong heterogeneity and to non-symmetric saddle point problems. Using proper regularized forms of the given matrix and its precon...
متن کاملPerformance and robustness of block constraint preconditioners in Finite Element coupled consolidation problems
Block constraint preconditioners are a most recent development for the iterative solution to large scale, often ill-conditioned, coupled consolidation problems. A major limitation to their practical use, however, is the somewhat difficult selection of a number of user-defined parameters (at least 4) in a more or less optimal way. The present paper investigates the robustness of three variant of...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملPreconditioners for Generalized Saddle-Point Problems
We propose and examine block-diagonal preconditioners and variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. That is, we consider the nonsymmetric, nonsingular case where the (2,2) block is small in norm, and we are particularly concerned with the case where the (1,2) block is different from the transposed (2,1) block. We provide theoretical and exper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 35 شماره
صفحات -
تاریخ انتشار 2013